DOIAbstract
Auseinandersetzung mit Thesen von Jean-Yves Girard zur beweistheoretischen Semantik der Logikprogrammierung.Discussion of certain claims by Jean-Yves Girard on the proof-theoretic semantics of logic programming
Auseinandersetzung mit Thesen von Jean-Yves Girard zur beweistheoretischen Semantik der Logikprogrammierung.Discussion of certain claims by Jean-Yves Girard on the proof-theoretic semantics of logic programming
The operational semantics of linear logic programming languages is given in terms of goal-driven se...
The subject of this thesis is the proof theory of logics with fixed points, such as the μ-calculus,l...
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J...
Auseinandersetzung mit Thesen von Jean-Yves Girard zur beweistheoretischen Semantik der Logikprogram...
In their paper "Type" Is Not a Type, Meyer and Reinhold argued that serious pathologies can result ...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
AbstractFrom a declarative programming point of view, Manna and Shamir's optimal fixedpoint semantic...
The fixpoint completion fix (P) of a normal logic program P is a program transformation such that th...
The variety of semantical approaches that have been invented for logic programs is quite broad, draw...
We consider rather general operators mapping valuations to (sets of) valuations in the context of th...
Version ancienne d'un article dont la version modifiée à finalement été acceptée pour publication en...
International audienceWe present a gentle introduction to the technical content of Girard's Transcen...
Fixed points play a fundamental role in several areas of computer science and logic by justifying in...
International audienceIs it possible to characterize the notion of proof in terms of acts, without f...
In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logi...
The operational semantics of linear logic programming languages is given in terms of goal-driven se...
The subject of this thesis is the proof theory of logics with fixed points, such as the μ-calculus,l...
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J...
Auseinandersetzung mit Thesen von Jean-Yves Girard zur beweistheoretischen Semantik der Logikprogram...
In their paper "Type" Is Not a Type, Meyer and Reinhold argued that serious pathologies can result ...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
AbstractFrom a declarative programming point of view, Manna and Shamir's optimal fixedpoint semantic...
The fixpoint completion fix (P) of a normal logic program P is a program transformation such that th...
The variety of semantical approaches that have been invented for logic programs is quite broad, draw...
We consider rather general operators mapping valuations to (sets of) valuations in the context of th...
Version ancienne d'un article dont la version modifiée à finalement été acceptée pour publication en...
International audienceWe present a gentle introduction to the technical content of Girard's Transcen...
Fixed points play a fundamental role in several areas of computer science and logic by justifying in...
International audienceIs it possible to characterize the notion of proof in terms of acts, without f...
In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logi...
The operational semantics of linear logic programming languages is given in terms of goal-driven se...
The subject of this thesis is the proof theory of logics with fixed points, such as the μ-calculus,l...
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J...
Add to ORKG